Monodromy Groups of Coverings of Curves

نویسنده

  • ROBERT GURALNICK
چکیده

We consider nite separable coverings of curves f : X → Y over a eld of characteristic p ≥ 0. We are interested in describing the possible monodromy groups of this cover if the genus of X is xed. There has been much progress on this problem over the past decade in characteristic zero. Recently Frohardt and Magaard completed the nal step in resolving the Guralnick Thompson conjecture showing that only nitely many nonabelian simple groups other than alternating groups occur as composition factors for a xed genus. There is an ongoing project to get a complete list of the monodromy groups of indecomposable rational functions with only tame rami cation. In this article, we focus on positive characteristic. There are more possible groups but we show that many simple groups do not occur as composition factors for a xed genus. We also give a reduction theorem reducing the problem to the case of almost simple groups. We also obtain some results on bounding the size of automorphism groups of curves in positive characteristic and discuss the relationship with the rst problem. We note that prior to these results there was not a single example of a nite simple group which could be ruled out as a composition factor of the monodromy group of a rational function in any positive characteristic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Degree Doubling Formula for Braid Monodromies and Lefschetz Pencils

Contents 1. Introduction 1 1.1. Braid monodromy invariants 3 1.2. The degree doubling process 6 1.3. Degree doubling for symplectic Lefschetz pencils 9 2. Stably quasiholomorphic coverings 10 2.1. Quasiholomorphic coverings and braided curves 10 2.2. Stably quasiholomorphic coverings 11 2.3. Proof of Proposition 1 18 3. The degree doubling formula for braid monodromies 21 3.

متن کامل

Orbits of Braid Groups on Cacti

One of the consequences of the classification of finite simple groups is the fact that non-rigid polynomials (those with more than two finite critical values), considered as branched coverings of the sphere, have exactly three exceptional monodromy groups (one in degree 7, one in degree 13 and one in degree 15). By exceptional here we mean primitive and not equal to Sn or An, where n is the deg...

متن کامل

The Large Sieve, Monodromy and Zeta Functions of Curves

We prove a large sieve statement for the average distribution of Frobenius conjugacy classes in arithmetic monodromy groups over finite fields. As a first application we prove a stronger version of a result of Chavdarov on the “generic” irreducibility of the numerator of the zeta functions in a family of curves with large monodromy.

متن کامل

COMPUTING THE BRAID MONODROMY OF COMPLETELY REDUCIBLE n-GONAL CURVES

Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the rectangular braid diagram (RBD) method is proposed to compute the braid monodromy of a completely reducible n-gonal curve, i.e. the curves in the form (y−y1(x))...(y−yn(x)) = 0 where n ∈ Z+ and yi ∈ C[x]. Also, an algorithm is presented to compute the Alexander polynomial of these curve comp...

متن کامل

Braid Monodromy of Special Curves

In this article, we compute the braid monodromy of two algebraic curves defined over R. These two curves are of complex level not bigger than 6, and they are unions of lines and conics. We use two different techniques for computing their braid monodromies. These results will be applied to computations of fundamental groups of their complements in C and CP.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003